Minimizing the maximum curvature of quadratic Bézier curves with a tetragonal concave polygonal boundary constraint

نویسندگان

  • Ji-wung Choi
  • Renwick E. Curry
  • Gabriel Hugh Elkaim
چکیده

In curve design such as highway design andmotion planning of autonomous vehicles, it may be important to minimize the maximum curvature. In this paper we address the problem of minimizing the maximum curvature of a quadratic Bézier curve within a boundary constraint determined by a tetragonal concave polygon. The curve is parameterized by lengths between its control points, called the ‘‘control lengths’’. Finally, numerical results demonstrate applicability of the method to smooth a piecewise linear path resulting from a path search technique. The results apply whenever it is desired to have a smooth transition between intersecting straight lines. © 2011 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal G^2-Hermite Interpolation by Rational Cubic Bézier Curves

In this paper, we study a geometric G^2 Hermite interpolation by planar rational cubic Bézier curves. Two data points, two tangent vectors and two signed curvatures interpolated per each rational segment. We give the necessary and the sufficient intrinsic geometric conditions for two C^2 parametric curves to be connected with G2 continuity. Locally, the free parameters w...

متن کامل

Real-Time Obstacle-Avoiding Path Planning for Mobile Robots

In this paper a computationally effective trajectory generation algorithm of mobile robots is proposed. The algorithm plans a reference path based on Voronoi diagram and Bézier curves, that meet obstacle avoidance criteria. Bézier curves defining the path are created such that the circumference convex polygon of their control points miss all obstacles. To give smoothness, they are connected und...

متن کامل

Construction of rational surface patches bounded by lines of curvature

The fact that the Darboux frame is rotation–minimizing along lines of curvature of a smooth surface is invoked to construct rational surface patches whose boundary curves are lines of curvature. For given patch corner points and associated frames defining the surface normals and principal directions, the patch boundaries are constructed as quintic RRMF curves, i.e., spatial Pythagorean–hodograp...

متن کامل

Curve fitting and fairing using conic splines

We present an efficient geometric algorithm for conic spline curve fitting and fairing through conic arc scaling. Given a set of planar points, we first construct a tangent continuous conic spline by interpolating the points with a quadratic Bézier spline curve or fitting the data with a smooth arc spline. The arc spline can be represented as a piecewise quadratic rational Bézier spline curve. ...

متن کامل

SIMPLIPOLY: Curvature-based polygonal curve simplification

A curvature-based algorithm to simplify a polygonal curve is described, together with its implementation. The so-called SimpliPoly algorithm uses Bézier curves to approximate pieces of the input curve, and assign curvature estimates to vertices of the input polyline from curvature values computed for the Bézier approximations. The implementation of SimpliPoly is interactive and available freely...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer-Aided Design

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2012